منابع مشابه
A sampling lower bound for permutations
A map f : [n]` → [n]n has locality d if each output symbol in [n] = {1, 2, . . . , n} depends only on d of the ` input symbols in [n]. We show that the output distribution of a d-local map has statistical distance at least 1−2 · exp(−n/ logcd n) from a uniform permutation of [n]. This seems to be the first lower bound for the well-studied problem of generating permutations. Because poly(n)-size...
متن کاملQuantum lower bound for recursive fourier sampling
We revisit the oft-neglected ‘recursive Fourier sampling’ (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one needs to go outside th...
متن کاملA Lower Bound on Opaque Sets
We prove a lower bound of 2.00002 on the the total length of a set (of curves) that intersects every line that intersects the unit square. The best known lower bound has been 2, established by Jones in 1964.
متن کاملA sharp lower bound for locating-dominating sets in trees
Let LD(G) denote the minimum cardinality of a locating-dominating set for graph G. If T is a tree of order n with l leaf vertices and s support vertices, then a known lower bound of Blidia, Chellali, Maffray, Moncel and Semri [Australas. J. Combin. 39 (2007), 219–232] is LD(T ) ≥ (n+ 1 + l − s)/3 . In this paper, we show that LD(T ) ≥ (n+ 1 + 2(l − s))/3 and these bounds are sharp. We construct...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2020
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3404858